Applications of Kolmogorov complexity to computable model theory
نویسندگان
چکیده
منابع مشابه
Applications of Kolmogorov complexity to computable model theory
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not א0-categorical saturated structure with a unique computable isomorphism type? Our answer is affirmative and uses a construction based on Kolmogorov complexity. With a variation of this construction, we also provide an example of an א1-categorical but not א0-categorical sa...
متن کاملKolmogorov Complexity: Sources, Theory and Applications
The theory of Kolmogorov complexity is based on the discovery, by Alan Turing in 1936, of the universal Turing machine. After proposing the Turing machine as an explanation of the notion of a computing machine, Turing found that there exists one Turing machine which can simulate any other Turing machine. Complexity, according to Kolmogorov, can be measured by the length of the shortest program ...
متن کاملApplications of Time-Bounded Kolmogorov Complexity in Complexity Theory
This paper presents one method of using time-bounded Kolmogorov complexity as a measure of the complexity of sets, and outlines a number of applications of this approach to di erent questions in complexity theory. Connections will be drawn among the following topics: NE predicates, ranking functions, pseudorandom generators, and hierarchy theorems in circuit complexity.
متن کاملTime - Bounded Kolmogorov Complexity in Complexity Theory
This paper presents one method of using time-bounded Kol-mogorov complexity as a measure of the complexity of sets, and outlines a number of applications of this approach to diierent questions in complexity theory. Connections will be drawn among the following topics: NE predicates, ranking functions, pseudorandom generators, and hierarchy theorems in circuit complexity.
متن کاملKolmogorov Complexity and Model Selection
The goal of statistics is to provide explanations (models) of observed data. We are given some data and have to infer a plausible probabilistic hypothesis explaining it. Consider, for example, the following scenario. We are given a “black box”. We have turned the box on (only once) and it has produced a sequence x of million bits. Given x, we have to infer a hypothesis about the black box. Clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2007
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1191333855